Generating Efficient Programs for Two-Level Memories from Tensor-products

This paper presents a framework for synthesizing eecient out-of-core programs for block recursive algorithms such as the fast Fourier transform (FFT) and Batcher's bitonic sort. The block recursive algorithms considered in this paper are described using tensor (Kronecker) product and other matrix operations. The algebraic properties of the matrix representation are used to derive eecient out-of-core programs. These programs are targeted towards a two-level disk model which allows HPF supported cyclic(B) data distribution on a disk array. The eeectiveness of our approach is demonstrated through an example out-of-core FFT program implemented on a workstation .